MAXIMAL CHAINS OF SUBWORDS AND UP-DOWN SEQUENCES OF PERMUTATIONSVIENNOT G.1983; JOURNAL OF COMBINATORIAL THEORY. SERIES A.; ISSN 0097-3165; USA; DA. 1983; VOL. 34; NO 1; PP. 1-14; BIBL. 25 REF.Article

RELATIONSHIP BETWEEN THE PERIOD OF A FINITE WORD AND THE LENGTH OF ITS UNBORDERED SEGMENTSDUVAL JP.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 40; NO 1; PP. 31-44; BIBL. 8 REF.Article

SUR LA DETERMINATION DU RANG D'UNE EQUATION DANS LE MONOIDE LIBREPECUCHET JP.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 3; PP. 337-340; BIBL. 4 REF.Article

ON SOME COMBINATORIAL PROBLEMS IN FREE MONOIDSDE LUCA A.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 38; NO 2-3; PP. 207-225; BIBL. 7 REF.Article

Bases de Lyndon des algèbres de Lie libres partiellement commutativesLALONDE, P.Theoretical computer science. 1993, Vol 117, Num 1-2, pp 217-226, issn 0304-3975Conference Paper

Groups of finite elementary codes = Groupes des codes élémentaires finisKATSURA, M; TANAKA, G.Theoretical computer science. 1993, Vol 108, Num 1, pp 119-149, issn 0304-3975Conference Paper

String matching problems over free partially commutative monoids = Les problèmes de mise en correspondance de chaîne de caractères sur des monoïdes libres partiellement commutatifsHASHIGUCHI, K; YAMADA, K.Information and computation (Print). 1992, Vol 101, Num 2, pp 131-149, issn 0890-5401Article

Rational relations as rational seriesCHOFFRUT, Christian.Theory is forever : essays dedicated to Arto Salomaa on the occasion of this 70th birthday. Lecture notes in computer science. 2004, pp 29-34, issn 0302-9743, isbn 3-540-22393-2, 6 p.Book Chapter

Note on the topological structure of random stringsCALUDE, C; CAMPEANU, C.Theoretical computer science. 1993, Vol 112, Num 2, pp 383-390, issn 0304-3975Article

On coding morphisms for zigzag codes = Les morphismes de codages pour les codes ZIGZAGDO LONG VAN; LE SAËC, B; LITOVSKY, I et al.Informatique théorique et applications (Imprimé). 1992, Vol 26, Num 6, pp 565-580, issn 0988-3754Article

The shuffle algtebra and its derivationsKATSURA, M; KOBAYASHI, Y.Theoretical computer science. 1993, Vol 115, Num 2, pp 359-369, issn 0304-3975Article

On the decidability of the equivalence problem for partially commutative rational power seriesVARRICCHIO, S.Theoretical computer science. 1992, Vol 99, Num 2, pp 291-299, issn 0304-3975Article

ON THE TRIANGLE CONJECTUREDE FELICE C.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 5; PP. 197-200; BIBL. 4 REF.Article

DISCRETE-TIME MACHINES IN CLOSED MONOIDAL CATEGORIES. I.GOGUEN JA.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 1; PP. 1-43; BIBL. 1 P.Article

SUR CERTAINES APPLICATIONS SEQUENTIELLES NUMERIQUES.CHRISTIAN C.1977; INFORM. AND CONTROL; U.S.A.; DA. 1977; VOL. 33; NO 4; PP. 352-363; ABS. ANGL.; BIBL. 13 REF.Article

SUR LES RELATIONS RATIONNELLES ENTRE MONOIDES LIBRES.SCHUETZENBERGER MP.1976; THEOR. COMPUT. SCI.; NETHERL.; DA. 1976; VOL. 3; NO 2; PP. 243-259; BIBL. 4 REF.Article

ANALYSES DES LANGAGES ALGEBRIQUES.MARQUE PUCHEU G.1975; ; S.L.; DA. 1975; PP. 1-88; BIBL. 1 P. 1/2; (THESE DOCT. 3E CYCLE, SPEC. MATH. APPL., MENTION INF.; PIERRE ET MARIE CURIE PARIS VI)Thesis

Decompositions of recognizable strong maximal codes = Décompositions des codes maximaux forts reconnaissablesLIANG ZHANG; WEIDE QIU.Theoretical computer science. 1993, Vol 108, Num 1, pp 173-183, issn 0304-3975Conference Paper

The set of strings mapped into a submonoid by iterates of a morphismHEAD, T.Theoretical computer science. 1990, Vol 73, Num 3, pp 329-333, issn 0304-3975, 5 p.Article

Overlap-free morphisms and finite test-setsRICHOMME, G; WLAZINSKI, F.Discrete applied mathematics. 2004, Vol 143, Num 1-3, pp 92-109, issn 0166-218X, 18 p.Article

The Möbius function of factor orderBJÖRNER, A.Theoretical computer science. 1993, Vol 117, Num 1-2, pp 91-98, issn 0304-3975Conference Paper

Théorèmes de transfert pour les polynômes partiellement commutatifs = Transfer theorem for partially commutative polynomialsDUCHAMP, G; THIBON, J. Y.Theoretical computer science. 1988, Vol 57, Num 2-3, pp 239-249, issn 0304-3975Article

Notes on finite asynchronous automataZIELONKA, W.Informatique théorique et applications (Imprimé). 1987, Vol 21, Num 2, pp 99-135, issn 0988-3754Article

CODES ET SOUS-MONOIDES POSSEDANT DES MOTS NEUTRES.PERRIN D; SCHUTZENBERGER MP.1977; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1977; NO 214; PP. 1-12; ABS. ANGL.; BIBL. 9 REF.Serial Issue

Page / 12